package baiDu;

import java.util.Scanner;

public class BaiDu {
	
	/**
	 * 乘法表
	 * 给定乘法表阶数m，n和乘法表递增序列的索引k，返回索引处的表项结果
	 */
	public static int plusTable(int m, int n, int k) {
//		int[][] table = new int[m][n];
		int[] tempTable = new int[m * n];
		int count = 0;
		for(int i = 0; i < m; i ++) {
			for(int j = 0; j < n; j ++) {
//				table[i][j] = (i + 1) * (j + 1);
				tempTable[count + j] = (i + 1) * (j + 1);
			}
			count += n;
		}
		//冒泡排序
		for(int i = 0; i < m * n - 1; i ++) {
			for(int j = 0; j < m * n - i- 1; j ++) {
				if(tempTable[j] > tempTable[j + 1]) {
					int temp = tempTable[j];
					tempTable[j] = tempTable[j + 1];
					tempTable[j + 1] = temp;
				}
			}
		}
		
		return tempTable[k - 1];
	}
	
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int m = sc.nextInt();
		int n = sc.nextInt();
		int k = sc.nextInt();
		int result = plusTable(m, n, k);
		System.out.println(result);
	}
}
